Перевод: с английского на русский

с русского на английский

computational formula

См. также в других словарях:

  • Computational formula for the variance — See also: Algorithms for calculating variance In probability theory and statistics, the computational formula for the variance Var(X) of a random variable X is the formula where E(X) is the expected value of X. A closely related identity can be… …   Wikipedia

  • Computational — may refer to: Computer Computational algebra Computational Aeroacoustics Computational and Information Systems Laboratory Computational and Systems Neuroscience Computational archaeology Computational auditory scene analysis Computational biology …   Wikipedia

  • Computational chemistry — is a branch of chemistry that uses principles of computer science to assist in solving chemical problems. It uses the results of theoretical chemistry, incorporated into efficient computer programs, to calculate the structures and properties of… …   Wikipedia

  • Computational electromagnetics — Computational electromagnetics, computational electrodynamics or electromagnetic modeling is the process of modeling the interaction of electromagnetic fields with physical objects and the environment. It typically involves using computationally… …   Wikipedia

  • Formula editor — A typeset mathematical expression A formula editor is a name for a computer program that is used to typeset mathematical works or formulae. Formula editors typically serve two purposes: They allow word processing and publication of technical… …   Wikipedia

  • Fórmula 1 — Fórmula 1 …   Wikipedia Español

  • Formula 1 — Formule 1 Pour les articles homonymes, voir F1 (homonymie). Formule 1 …   Wikipédia en Français

  • Computational complexity of mathematical operations — The following tables list the running time of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine.[1] See big O notation for an explanation …   Wikipedia

  • Formula game — A formula game is an artificial game represented by a fully quantified Boolean formula. Players turns alternate and the space of possible moves is denoted by bound variables. If a variable is universally quantified, the formula following it has… …   Wikipedia

  • Computational tree logic — Computation tree logic (CTL) is a branching time logic, meaning that its model of time is a tree like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is… …   Wikipedia

  • True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»